Nontrivial Rational Polynomials in Two Variables Have Reducible Fibres

نویسنده

  • WALTER D. NEUMANN
چکیده

We shall call a polynomial map f : C → C a “coordinate” if there is a g such that (f, g) : C → C is a polynomial automorphism. Equivalently, by AbhyankarMoh and Suzuki, f has one and therefore all fibres isomorphic to C. Following [7] we call a polynomial f : C → C “rational” if the general fibres of f (and hence all fibres of f) are rational curves. The following theorem, which says that a rational polynomial map with irreducible fibres cannot be part of a counterexample to the 2-dimensional Jacobian Conjecture, has appeared in the literature several times. It appears with an algebraic proof in Razar [12]. It is Theorem 2.5 of Heitmann [4] (as corrected in the Corrigendum), and Lê and Weber, who give a geometric proof in [6], also cite the reference Friedland [3], which we have not seen.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalization of Gottlieb polynomials in several variables

Gottlieb polynomials were introduced and investigated in 1938, and then have been cited in several articles. Very recently Khan and Akhlaq introduced and investigated Gottlieb polynomials in two and three variables to give their generating functions. Subsequently, Khan and Asif investigated the generating functions for the q-analogue of Gottlieb polynomials. In this sequel, by modifying Khan an...

متن کامل

Reducible cubic CNS polynomials

The concept of a canonical number system can be regarded as a natural generalization of decimal representations of rational integers to elements of residue class rings of polynomial rings. Generators of canonical number systems are CNS polynomials which are known in the linear and quadratic cases, but whose complete description is still open. In the present note reducible CNS polynomials are tr...

متن کامل

Survey on Counting Special Types of Polynomials

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gauß count the remaining ones, approximately and exactly. For polynomials in two or more variables, the situation changes dramatically. Most multivariate polynomials are irreducible. This survey presents counting results for some special classes of mu...

متن کامل

Noether's forms for the study of non-composite rational functions and their spectrum

In this paper, the spectrum and the decomposability of a multivariate rational function are studied by means of the effective Noether’s irreducibility theorem given by Ruppert in [19]. With this approach, some new effective results are obtained. In particular, we show that the reduction modulo p of the spectrum of a given integer multivariate rational function r coincides with the spectrum of t...

متن کامل

Signal detection Using Rational Function Curve Fitting

In this manuscript, we proposed a new scheme in communication signal detection which is respect to the curve shape of received signal and based on the extraction of curve fitting (CF) features. This feature extraction technique is proposed for signal data classification in receiver. The proposed scheme is based on curve fitting and approximation of rational fraction coefficients. For each symbo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998